On the Power of Different Types of Restricted Branching Programs

نویسندگان

  • Beate Bollig
  • Martin Sauerhoff
  • Detlef Sieling
  • Ingo Wegener
چکیده

Almost the same types of restricted branching programs (or binary decision diagrams BDDs) are considered in complexity theory and in applications like hardware veriication. These models are read-once branching programs (free BDDs) and certain types of oblivious branching programs (ordered and indexed BDDs with k layers). The complexity of the satissability problem for these restricted branching programs is investigated and tight hierarchy results are proved for the classes of functions representable by k layers of ordered or indexed BDDs of polynomial size.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Quantum Ordered Binary Decision Diagrams with Repeated Tests

Quantum branching programs (quantum binary decision diagrams, respectively) are a convenient tool for examining quantum computations using only a logarithmic amount of space. Recently several types of restricted quantum branching programs have been considered, e. g. read–once quantum branching programs. This paper considers quantum ordered binary decision diagrams (QOBDDs) and answers the quest...

متن کامل

ON THE POWER FUNCTION OF THE LRT AGAINST ONE-SIDED AND TWO-SIDED ALTERNATIVES IN BIVARIATE NORMAL DISTRIBUTION

This paper addresses the problem of testing simple hypotheses about the mean of a bivariate normal distribution with identity covariance matrix against restricted alternatives. The LRTs and their power functions for such types of hypotheses are derived. Furthermore, through some elementary calculus, it is shown that the power function of the LRT satisfies certain monotonicity and symmetry p...

متن کامل

A Hierarchy Result for Read-Once Branching Programs with Restricted Parity Nondeterminism

Restricted branching programs are considered in complexity theory in order to study the space complexity of sequential computations and in applications as a data structure for Boolean functions. In this paper (⊕, k)-branching programs and (∨, k)-branching programs are considered, i.e., branching programs starting with a ⊕(or ∨-)node with a fan-out of k whose successors are k read-once branching...

متن کامل

Restricted Nondeterministic Read-Once Branching Programs and an Exponential Lower Bound for Integer Multiplication

Branching programs are a well established computation model for Boolean functions, especially read-once branching programs have been studied intensively. In this paper the expressive power of nondeterministic read-once branching programs, i.e., the class of functions representable in polynomial size, is investigated. For that reason two restricted models of nondeterministic read-once branching ...

متن کامل

Hierarchy Theorems for kOBDDs and kIBDDs

Beate Bollig , Martin Sauerho , Detlef Sieling , and Ingo Wegener FB Informatik, LS II, Univ. Dortmund, 44221 Dortmund, Germany bollig-, sauerhof-, sieling-, [email protected] Abstract Almost the same types of restricted branching programs (or binary decision diagrams BDDs) are considered in complexity theory and in applications like hardware veri cation. These models are r...

متن کامل

ذخیره در منابع من

ذخیره در منابع من قبلا به منابع من ذحیره شده

{@ msg_add @}


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Electronic Colloquium on Computational Complexity (ECCC)

دوره 1  شماره 

صفحات  -

تاریخ انتشار 1994